Why Are Big Data Matrices Approximately Low Rank?
نویسندگان
چکیده
منابع مشابه
Low-rank Matrices with Missing Data
A technique for building consistent 3D reconstructions from many views based on fitting a low rank matrix to a matrix with missing data is presented. Rank-four submatrices of minimal, or slightly larger, size are sampled and spans of their columns are combined to constrain a basis of the fitted matrix. The error minimized is expressed in terms of the original subspaces which leads to a better r...
متن کاملWhy Big Data Needs Big Buffer Switches
Today’s cloud data applications, including Hadoop, Big Data, Search or Storage, are distributed applications running on server clusters with many-to-many communication patterns. The key to achieving predictable performance for these distributed applications is to provide consistent network bandwidth and latency to the various traffic flows since in most cases it is the slowest flow or query com...
متن کاملSingular Value Reassignment with Low Rank Matrices
Abstract. Analogous to the pole assignment problem where eigenvalues of a square matrix are relocated, this paper considers the problem of reassigning singular values of a rectangular matrix by additive low rank matrices. Precise and easy-to-check necessary and sufficient conditions under which the problem is solvable are completely characterized, generalizing some traditional singular value in...
متن کاملVector Spaces of Matrices of Low Rank
In this paper we study vector spaces of matrices, all of whose elements have rank at most a given number. The problem of classifying such spaces is roughly equivalent to the problem of classifying certain torsion-free sheaves on projective spaces. We solve this problem in case the sheaf in question has first Chern class equal to 1; the characterization of the vector spaces of matrices of rank d...
متن کاملRobust Generalized Low Rank Approximations of Matrices
In recent years, the intrinsic low rank structure of some datasets has been extensively exploited to reduce dimensionality, remove noise and complete the missing entries. As a well-known technique for dimensionality reduction and data compression, Generalized Low Rank Approximations of Matrices (GLRAM) claims its superiority on computation time and compression ratio over the SVD. However, GLRAM...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Mathematics of Data Science
سال: 2019
ISSN: 2577-0187
DOI: 10.1137/18m1183480